Bounding graph diameters of nonsolvable groups

Diameters of Degree Graphs of Nonsolvable Groups

Diameters of Degree Graphs of Nonsolvable Groups, II

Let G be a finite group and let cd(G) be the set of irreducible character degrees of G. The degree graph ∆(G) is the graph whose set of vertices is the set of primes that divide degrees in cd(G), with an edge between p and q if pq divides a for some degree a ∈ cd(G). It is shown using the degree graphs of the finite simple groups that if G is a nonsolvable group, then the diameter of ∆(G) is at...

Four-Vertex Degree Graphs of Nonsolvable Groups

For a finite group G, the character degree graph ∆(G) is the graph whose vertices are the primes dividing the degrees of the ordinary irreducible characters of G, with distinct primes p and q joined by an edge if pq divides some character degree of G. We determine all graphs with four vertices that occur as ∆(G) for some nonsolvable group G. Along with previously known results on character degr...

Connectedness of Degree Graphs of Nonsolvable Groups

Nonsolvable Groups Satisfying the One-Prime Hypothesis

Throughout this paper, G is a finite group and Irr(G) is the set of irreducible characters of G. We are particularly interested in the values these characters take on the identity of G. If χ ∈ Irr(G), then χ(1) is the degree of χ. The set of all degrees for G is written cd(G) = {χ(1) |χ ∈ Irr(G)}. In recent years, there has been much interest in finding connections between the structure of a fi...